Fragility and indestructibility II
نویسنده
چکیده
In this paper we continue work from a previous paper on the fragility and indestructibility of the tree property. We present the following: (1) A preservation lemma implicit in Mitchell’s PhD thesis, which generalizes all previous versions of Hamkins’ Key lemma. (2) A new proof of theorems the ‘superdestructibility’ theorems of Hamkins and Shelah. (3) An answer to a question from our previous paper on the apparent consistency strength of the assertion “The tree property at א2 is indestructible under א2-directed closed forcing”. (4) Two models for successive failures of weak square on long intervals of cardinals. Techniques for preserving the tree property are central to a growing literature of consistency results obtaining the tree property as successive regular cardinals (see for example [11, 1, 3, 15, 20]). These techniques can be viewed abstractly as indestructibility results, which typically arise from either integration of preparation forcing or preservation lemmas. In our original paper [18] we proved results using both of these methods. In particular, using methods of Abraham and Cummings and Foreman [3, 1] we showed that modulo the existence of a supercompact cardinal it is consistent that the tree property holds at ω2 and is indestructible under ω2-directed closed forcing. Further, by proving a new preservation lemma we showed that the tree property at ω2 in a model of Mitchell [11] is indestructible under the forcing to add an arbitrary number of Cohen reals. It follows that the tree property at ω2 is consistent with 2 ω > ω2. The preservation lemma was Lemma 0.1. Let τ, η be cardinals with η regular and 2 ≥ η. Let P be τ-cc and R be τ-closed. Let Ṫ be a P-name for an η-tree. Then in V [P] forcing with R cannot add a branch through T . Date: June 23, 2015. 2010 Mathematics Subject Classification. 03E35,03E55.
منابع مشابه
Unprepared Indestructibility
I present a forcing indestructibility theorem for the large cardinal axiom Vopěnka’s Principle. It is notable in that there is no preparatory forcing required to make the axiom indestructible, unlike the case for other indestructibility results. §
متن کاملFragility and indestructibility of the tree property
We prove various theorems about the preservation and destruction of the tree property at ω2. Working in a model of Mitchell [9] where the tree property holds at ω2, we prove that ω2 still has the tree property after ccc forcing of size א1 or adding an arbitrary number of Cohen reals. We show that there is a relatively mild forcing in this same model which destroys the tree property. Finally we ...
متن کاملForcing indestructibility of MAD families
Let A ⊆ [ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families wh...
متن کاملAn equiconsistency for universal indestructibility
We obtain an equiconsistency for a weak form of universal indestructibility for strongness. The equiconsistency is relative to a cardinal weaker in consistency strength than a Woodin cardinal, Stewart Baldwin’s notion of hyperstrong cardinal. We also briefly indicate how our methods are applicable to universal indestructibility for supercompactness and strong compactness. ∗2000 Mathematics Subj...
متن کاملSome Applications of Sargsyan’s Equiconsistency Method
We apply techniques due to Sargsyan to reduce the consistency strength of the assumptions used to establish an indestructibility theorem for supercompactness. We then show how these and additional techniques due to Sargsyan may be employed to establish an equiconsistency for a related indestructibility theorem for strongness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 166 شماره
صفحات -
تاریخ انتشار 2015